Adding Priority to Event Structures

نویسندگان

  • Youssef Arbach
  • Kirstin Peters
  • Uwe Nestmann
چکیده

Event Structures (ESs) are mainly concerned with the representation of causal relationships between events, usually accompanied by other event relations capturing conflicts and disabling. Among the most prominent variants of ESs are Prime ESs, Bundle ESs, Stable ESs, and Dual ESs, which differ in their causality models and event relations. Yet, some application domains require further kinds of relations between events. Here, we add the possibility to express priority relationships among events. We exemplify our approach on Prime, Bundle, Extended Bundle, and Dual ESs. Technically, we enhance these variants in the same way. For each variant, we then study the interference between priority and the other event relations. From this, we extract the redundant priority pairs—notably differing for the types of ESs—that enable us to provide a comparison between the extensions. We also exhibit that priority considerably complicates the definition of partial orders in ESs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bundle Event Structures and CCSP

We investigate which event structures can be denoted by means of closed CCS CSP expressions. Working up to isomorphism we find that all denotable event structures are bundle event structures, upon adding an infinitary parallel composition all bundle event structures are denotable, without it every finite bundle event structure can be denoted, as well as every countable prime event structure wit...

متن کامل

Algebraic Expression of the Structure Function of a subclass of Dynamic Fault Trees

This paper focuses on a subclass of Dynamic Fault Trees (DFTs), called Priority Dynamic Fault Trees (PDFTs), containing only static gates and Priority Dynamic Gates (PAND and FDEP) for which a priority relation among the input nodes completely determines the output behavior. We define events as temporal variables and we show that, by adding to the usual Boolean operators new temporal operators ...

متن کامل

Smart priority queue algorithms for self-optimizing event storage

Low run-time overhead, self-adapting storage policies for priority queues called Smart Priority Queue (SPQ) techniques are developed and evaluated. The proposed SPQ policies employ a lowcomplexity linear queue for near-head activities and a rapid-indexing variable bin-width calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost-scor...

متن کامل

MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues

Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branchand-bound. However, a classical priority queue constitutes a severe bottleneck in this context, leading to very small throughput. Hence, there has been significant interest in concurrent priority queues with a somewhat relaxed semantics w...

متن کامل

Priority in DBMS Resource Scheduling

In this paper, we address the problem of priority scheduling in a database management system. We start by investigating the architectural consequences of adding priority to a DBMS. Specific priority-based schemes are then proposed for managing DBMS resources. including a priority-based diik scheduling algorithm and two approaches to adding priority to the buffer manager of a DBMS. We study the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013